Grammatical Inference of Dashed Lines

نویسندگان

  • Arnold Jonk
  • Rein van den Boomgaard
  • Arnold W. M. Smeulders
چکیده

Dashed lines are a common, and semantically important, element in line drawings. This paper deals with the inference of a dashed lines’ grammar, given a stream of graphical symbols. A method is presented, based on syntactical pattern recognition, capable of inferring arbitrary grammars without a priori knowledge. A detailed complexity-analysis of the developed algorithms is presented, as well as experiments demonstrating the usefullness of our method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dotted and dashed lines in METAFONT

We show how to draw evenly dotted and dashed curved lines in METAFONT, using recursive refinement of paths. METAPOST provides extra primitives that can be used for this task, but the method presented here can be used for both METAFONT and METAPOST.

متن کامل

Automatic camera calibration method based on dashed lines

We present a new method for full-automatic calibration of traffic cameras using the end points on dashed lines. Our approach uses the improved RANSAC method with the help of pixels transverse projection to detect the dashed lines and end points on them. Then combining analysis of the geometric relationship between the camera and road coordinate systems, we construct a road model to fit the end ...

متن کامل

Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems

Empirical grammatical inference systems are practical systems that learn structure from sequences, in contrast to theoretical grammatical inference systems, which prove learnability of certain classes of grammars. All current empirical grammatical inference evaluation methods are problematic, i.e. dependency on language experts, appropriateness and quality of an underlying grammar of the data, ...

متن کامل

Developing JSequitur to Study the Hierarchical Structure of Biological Sequences in a Grammatical Inference Framework of String Compression Algorithms

Grammatical inference methods are expected to find grammatical structures hidden in biological sequences. One hopes that studies of grammar serve as an appropriate tool for theory formation. Thus, we have developed JSequitur for automatically generating the grammatical structure of biological sequences in an inference framework of string compression algorithms. Our original motivation was to fi...

متن کامل

Information Extraction using Context-free Grammatical Inference from Positive Examples

Information extraction from textual data has various applications, such as semantic search. Learning from positive example have theoretical limitations, for many useful applications (including natural languages), substantial part of practical structure (CFG) can be captured by framework introduced in this paper. Our approach to automate identification of structural information is based on gramm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Vision and Image Understanding

دوره 74  شماره 

صفحات  -

تاریخ انتشار 1999